A characterization of discretized polygonal convex regions by discrete momentsZUNIC, Jovisa.Lecture notes in computer science. 2003, pp 529-536, issn 0302-9743, isbn 3-540-20590-X, 8 p.Conference Paper

TessellationsFULTON, C.The American mathematical monthly. 1992, Vol 99, Num 5, pp 442-445, issn 0002-9890Article

On computing the optimal bridge between two convex polygonsBHATTACHARYA, Binay; BENKOCZI, Robert.Information processing letters. 2001, Vol 79, Num 5, pp 215-221, issn 0020-0190Article

Computing a maximum axis-aligned rectangle in a convex polygonFISCHER, P; HÖFFGEN, K.-U.Information processing letters. 1994, Vol 51, Num 4, pp 189-193, issn 0020-0190Article

Sweeping an oval to a vanishing pointDUMITRESCU, Adrian; MINGHUI JIANG.Discrete applied mathematics. 2011, Vol 159, Num 14, pp 1436-1442, issn 0166-218X, 7 p.Article

Convex decomposition of U-polygonsDULIO, Paolo.Theoretical computer science. 2008, Vol 406, Num 1-2, pp 80-89, issn 0304-3975, 10 p.Article

Triangulating a convex polygon with fewer number of non-standard barsYINFENG XU; WENQIANG DAI; KATOH, Naoki et al.Theoretical computer science. 2007, Vol 389, Num 1-2, pp 143-151, issn 0304-3975, 9 p.Article

Protecting critical facets in layered manufacturing: implementation and experimental resultsSCHWERDT, Jörg; SMID, Michiel; JANARDAN, Ravi et al.Computer-aided design. 2003, Vol 35, Num 7, pp 647-657, issn 0010-4485, 11 p.Article

An elementary proof of the Ambartzumian-Pleijel identityCABO, A. J.Mathematical proceedings of the Cambridge Philosophical Society. 1992, Vol 112, Num 3, pp 535-538, issn 0305-0041Article

On Unfolding Lattice Polygons/Trees and Diameter-4 TreesPOON, Sheung-Hung.Lecture notes in computer science. 2006, pp 186-195, issn 0302-9743, isbn 3-540-36925-2, 1Vol, 10 p.Conference Paper

Comparing hypergraphs by areas of hyperedges drawn on a convex polygonITO, Hiro; NAGAMOCHI, Hiroshi.Lecture notes in computer science. 2003, pp 176-181, issn 0302-9743, isbn 3-540-20776-7, 6 p.Conference Paper

Finding the Convex Hull of a Simple PolygonYAZDI, Ebrahim; AZIZI, Vahid; NUROLLAH, Ali et al.Scientific computing. International conferenceWorldComp'2010. 2010, pp 159-163, isbn 1-60132-137-6, 5 p.Conference Paper

Drawing undirected graphs with genetic algorithmsZHANG, Qing-Guo; LIU, Hua-Yong; WEI ZHANG et al.Lecture notes in computer science. 2005, issn 0302-9743, isbn 3-540-28323-4, 3Vol, Part 3, 28-36Conference Paper

Finite edge-to-edge tilings by convex polygonsBLIND, Roswitha; SHEPHARD, G. C.Mathematika. 2001, Vol 48, pp 25-50, issn 0025-5793, 26 p., 1-2Article

Placing two disks in a convex polygonSUNG KWON KIM; SHIN, C.-S; YANG, T.-C et al.Information processing letters. 2000, Vol 73, Num 1-2, pp 33-39, issn 0020-0190Article

Finding minimal convex nested polygonsAGGARWAL, A; BOOTH, H; O'ROURKE, J et al.Information and computation (Print). 1989, Vol 83, Num 1, pp 98-110, issn 0890-5401Article

A proof of Coleman's conjectureKOLODZIEJCZYK, Krzysztof; OLSZEWSKA, Daria.Discrete mathematics. 2007, Vol 307, Num 15, pp 1865-1872, issn 0012-365X, 8 p.Article

Exact and efficient construction of planar minkowski sums using the convolution methodWEIN, Ron.Lecture notes in computer science. 2006, pp 829-840, issn 0302-9743, isbn 3-540-38875-3, 1Vol, 12 p.Conference Paper

A geometric method for determining intersection relations between a movable convex object and a set of planar polygonsKAI TANG; LIU, Yong-Jin.IEEE transactions on robotics. 2004, Vol 20, Num 4, pp 636-650, issn 1552-3098, 15 p.Article

Partitioning a planar point set into empty convex polygonsREN DING; HOSONO, Kiyoshi; URABE, Masatsugu et al.Lecture notes in computer science. 2003, pp 129-134, issn 0302-9743, isbn 3-540-20776-7, 6 p.Conference Paper

A convex polygon is determined by its Hough transformROSENFELD, A; WEISS, I.Pattern recognition letters. 1995, Vol 16, Num 3, pp 305-306, issn 0167-8655Article

An efficient algorithm for line clipping by convex polygonSKALA, V.Computers & graphics. 1993, Vol 17, Num 4, pp 417-421, issn 0097-8493Article

Families of m-convex polygons: m = 1JAMES, W. R. G; GUTTMANN, A. J.Advances in applied mathematics (Print). 2005, Vol 34, Num 4, pp 812-844, issn 0196-8858, 33 p.Article

A non-recursive algorithm for polygon triangulationSTANIMIROVIC, Predrag S; KRTOLICA, Predrag V; STANOJEVIC, Rade et al.Yugoslav journal of operations research. 2003, Vol 13, Num 1, pp 61-67, issn 0354-0243, 7 p.Article

An algorithm for a simple construction of suboptimal digital convex polygonsACKETA, D. M; MATIC-KEKIC, S; ZUNIC, J. D et al.Yugoslav journal of operations research. 1992, Vol 2, Num 1, pp 73-81, issn 0354-0243Article